Mixture Models for Distance Sampling Detection Functions
نویسندگان
چکیده
منابع مشابه
Mixture Models for Distance Sampling Detection Functions
We present a new class of models for the detection function in distance sampling surveys of wildlife populations, based on finite mixtures of simple parametric key functions such as the half-normal. The models share many of the features of the widely-used "key function plus series adjustment" (K+A) formulation: they are flexible, produce plausible shapes with a small number of parameters, allow...
متن کاملSlice sampling mixture models
We propose a more efficient version of the slice sampler for Dirichlet process mixture models described by Walker (Commun. Stat., Simul. Comput. 36:45–54, 2007). This new sampler allows for the fitting of infinite mixture models with a wide-range of prior specifications. To illustrate this flexibility we consider priors defined through infinite sequences of independent positive random variables...
متن کاملDeriving Cluster Analytic Distance Functions from Gaussian Mixture Models
The reliable detection of clusters in datasets of non-trivial dimensionality is notoriously difficult. Clustering algorithms are generally driven by some distance function (usually Euclidean) defined over pairs of examples, which implicitly treats distances within and between clusters alike. In this paper, a more effective distance measure is proposed, derived from an a priori estimated Gaussia...
متن کاملBayesian Methods for Hierarchical Distance Sampling Models
The few distance sampling studies that use Bayesian methods typically consider only line transect sampling with a half-normal detection function. We present a Bayesian approach to analyse distance sampling data applicable to line and point transects, exact and interval distance data and any detection function possibly including covariates affecting detection probabilities. We use an integrated ...
متن کاملEfficient MCMC sampling in dynamic mixture models
We show how to improve the efficiency of MCMC sampling in dynamic mixture models by block-sampling the discrete latent variable. Two algorithms are proposed: the first is a multi-move extension of the single-move Gibbs sampler devised by Gerlach, Carter and Kohn (2000); the second is an adaptive Metropolis-Hastings scheme that performs well even when the number of discrete states is large. Thre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2015
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0118726